Sample Sort on Meshes
نویسنده
چکیده
Sorting on interconnection networks has been solved ‘optimally’. However, the ‘lowerorder’ terms are so large that they dominate the overall time-consumption for many practical problem sizes. Particularly for deterministic algorithms, this is a serious problem. In this paper a refined deterministic sampling strategy is presented, by which the additional term of the presented deterministic sorting algorithm is hardly larger than the one of the best randomized algorithm.
منابع مشابه
Localized Delaunay Refinement for Sampling and Meshing
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one lacuna that limits its application. It does not scale well with the mesh size. As the sample point set grows, the Delaunay triangulation starts stressing the available memory space which ultimately stalls any effective p...
متن کاملA Topological Approach for Handling Triangle Insertion and Removal into Two- Dimensional Unstructured Meshes
Several algorithms for generating two-dimensional unstructured meshes use triangle insertion and removal as their basic operations. This work presents a robust mathematical framework, based on Morse Theory, which allows full control of the topological changes caused by the insertion or removal of triangles into 2D meshes. Topological control is ensured by a set of Morse operators and simplifies...
متن کاملGeneration of Quad and Hex Dominant Semistructured Meshes Using an Advancing Layer Scheme
A novel algorithm to generate quadand hex-dominant, semistructured meshes is presented. The algorithm utilizes a three-step, advancing layer scheme to generate the mesh in structured layers starting from an initial data surface. First, a locally orthogonal reference mesh is algebraically generated. The reference mesh is then smoothed using a Poisson-type mesh generation equation. Finally, a lin...
متن کاملComputational analysis of 4-8 meshes with application to surface simplification using global error
We present computational results when computing approximations of a class of meshes with subdivision connectivity, known as 4-8 meshes. We consider algorithms using vertex decimation or vertex insertion. We explain that a full decomposition of a 4-8 mesh using global error can be obtained with an (n logn) decimation algorithm. Our algorithm produces progressive and adaptive representations of t...
متن کاملSorting n Numbers on n x n Reconfigurable Meshes with Buses
We show how column sort [LEIG85] and rotate sort [MARB88] can be implemented on the different reconfigurable mesh with buses (RMB) architectures that have been proposed in the literature. On all of these proposed RMB architectures, we are able to sort n numbers on an n × n configuration in O(1) time. For the PARBUS RMB architecture [WANG90ab], our column sort and rotate sort implementations are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997